Sylow p-groups of polynomial permutations on the integers mod pn

نویسندگان

  • Sophie Frisch
  • Daniel Krenn
چکیده

Article history: Received 9 July 2012 Accepted 23 June 2013 Available online 4 September 2013 Communicated by D. Wan MSC: primary 20D20 secondary 11T06, 13M10, 11C08, 13F20, 20E18

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sylow Groups of Groups of Polynomial Permutations

We enumerate and describe the Sylow p-groups of the group of polynomial permutations of the integers mod p . MSC 2000: primary 20D20, secondary 11T06, 13M10, 11C08, 13F20, 20E18.

متن کامل

Finding Sylow Normalizers in Polynomial Time

Given a set r of permutations of an n-set, let G be the group of permutations generated by r. I f p is any prime, it is known that a Sylow p-subgroup P of G can be found in polynomial time. We show that the normalizer of P can also be found in polynomial time. In particular, given two Sylow p-subgroups of G, all elements conjugating one to the other can be found (as a coset of the normalizer of...

متن کامل

Polynomial functions on finite commutative rings

Every function on a nite residue class ring D=I of a Dedekind domain D is induced by an integer-valued polynomial on D that preserves congruences mod I if and only if I is a power of a prime ideal. If R is a nite commutative local ring with maximal ideal P of nilpotency N satisfying for all a; b 2 R, if ab 2 Pn then a 2 P k , b 2 P j with k + j min(n;N), we determine the number of functions (as...

متن کامل

Sylow's Theorem in Polynomial Time

Given a set r of permutations of an n-set, let G be the group of permutations generated by f. If p is a prime, a Sylow p-subgroup of G is a subgroup whose order is the largest power of p dividing IGI. For more than 100 years it has been known that a Sylow p-subgroup exists, and that for any two Sylow p-subgroups PI, P, of G there is an element go G such that Pz = g-‘PI g. We present polynomial-...

متن کامل

Polynomial-Time Versions of Sylow's Theorem

Let G be a subgroup of S,, given in terms of a generating set of permutations, and let p be a prime divisor of 1 G 1. If G is solvable-and, more generally, if the nonabelian composition factors of G are suitably restricted-it is shown that the following can be found in polynomial time: a Sylow p-subgroup of G containing a given p-subgroup, and an element of G conjugating a given Sylow p-subgrou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013